Anonymous Communication via Anonymous Identity-Based Encryption and Its Application in IoT
نویسندگان
چکیده
منابع مشابه
Improved Anonymous Multi-receiver Identity-Based Encryption
In 2010, Fan et al. proposed an efficient anonymous multi-receiver identity-based encryption scheme. This scheme allows a sender to send an encrypted message to a set of designated receivers while preserving receiver anonymity. The scheme is highly efficient for each receiver as it requires only two pairing operations. However, we found that the scheme failed to protect receiver anonymity and t...
متن کاملImprovement of One Anonymous Identity-Based Encryption
In 2009, Seo et al. proposed an anonymous hierarchical identity-based encryption (IBE). The ciphertext consists of (C1, C2, C3, C4), where C1 is the blinded message, C4 is the blinded identity, both C2 and C3 are used as decrypting helpers. To prove its security, the authors defined five games and introduced a strong simulator who is able to select different Setups for those games. In this pape...
متن کاملAnonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
Efficient and privacy-preserving constructions for search functionality on encrypted data is important issues for data outsourcing, and data retrieval, etc. Fully secure anonymous Hierarchical ID-Based Encryption (HIBE) schemes is useful primitives that can be applicable to searchable encryptions [4], such as ID-based searchable encryption, temporary searchable encryption [1], and anonymous for...
متن کاملFully Anonymous Identity-based Broadcast Encryption without Random Oracles
In a broadcast encryption (BE) scheme, a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not anonymous, which means the attacker can obtain the identities of all receivers from the ciphertext. Currently, anonymous IBBE schemes are only provably secure in the random oracle model. In this ...
متن کاملAnonymous Fuzzy Identity-Based Encryption for Similarity Search
In this paper, we consider the problem of predicate encryption and focus on the predicate for testing whether the hamming distance between the attribute X of a data item and a target V is equal to (or less than) a threshold t where X and V are of length m. Existing solutions either do not provide attribute protection or produce a big ciphertext of size O(m2). For the equality version of the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wireless Communications and Mobile Computing
سال: 2018
ISSN: 1530-8669,1530-8677
DOI: 10.1155/2018/6809796